منابع مشابه
Odd permutations are nicer than even ones
We give simple combinatorial proofs of some formulas for the number of factorizations of permutations in Sn as a product of two n-cycles, or of an n-cycle and an (n − 1)-cycle. © 2012 Elsevier Ltd. All rights reserved.
متن کاملEven is better than odd: one fat may conceal another.
1 2 Christophe BEAULOYE , Sandrine HORMAN & Luc BERTRAND 3 4 Université catholique de Louvain, Institut de Recherche Expérimentale et Clinique, Pole of 5 Cardiovascular Research, Brussels, Belgium; Cliniques Universitaires Saint-Luc, Division of 6 Cardiology, Brussels, Belgium 7 8 9 Address for correspondence: Luc Bertrand 10 Pole of Cardiovascular Research 11 Institut de Recherche Expérimental...
متن کاملSynchrotron Radiation Studies on Even-Odd and Odd-Even Nylons
Aliphatic polyamides derived from odd diamine or odd dicarboxylic acid units cannot adopt a conventional sheet structure when molecular chains have an all trans conformation. However, typical fiber diffraction patterns of this sheet structure were observed in several polyamides derived from odd units such as nylons 65 and 56. Consequently, a new structure based on the establishment of intermole...
متن کاملA note on the total number of cycles of even and odd permutations
We prove bijectively that the total number of cycles of all even permutations of [n] = {1, 2, . . . , n} and the total number of cycles of all odd permutations of [n] differ by (−1)(n − 2)!, which was proposed by Miklós Bóna. We also prove bijectively the following more general identity: n
متن کاملBalanced permutations Even-Mansour ciphers
The r-rounds Even–Mansour block cipher is a generalization of the well known Even–Mansour block cipher to r iterations. Attacks on this construction were described by Nikolić et al. and Dinur et al. for r = 2, 3. These attacks are only marginally better than brute force but are based on an interesting observation (due to Nikolić et al.): for a “typical” permutation P, the distribution of P(x)⊕ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2012
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.03.012